connected graph

The ( Adjacent) Tree Graph of a Connected Graph Is Upper Embeddable

连通图的（邻接）树图的上可嵌入性

A polynomial algorithm of finding a K partition for an undirected simple k connected graph

K连通图的k分割多项式算法

The Wiener index is the sum of distances between all pairs of vertices in a ( connected) graph.

Wiener指数是连通图的点对的距离之和。

The reasonable orientation problem of 2-edge connected graph

2-边连通图的合理定向问题

After using rooted connected directed graph to describe the Web view model of bioinformatics secondary database, this paper addresses the bioinformatics background knowledge into the designation of the Web views and its related connection.

提出采用带根连通有向图来描述生物信息二级数据库的Web视图模型，以结合生物信息背景知识设计特定的生物信息Web视图及其间的相关关系。

Let G be a finite simple connected graph with a perfect matching.

设G是一个连通的简单图且具有完美匹配。

A Note on the p Critical 2-Edge-Connected Graph

关于p阶临界2边连通图的一个注记

For simplicity we assume that the graph of the network is connected.

为了简便起见,假设网络的图是连通的.

For a given graph G of order n, a routing R is a set of n ( n-1) elementary paths such that every ordered pair of vertices in G are connected by a path in the set.

对于给定的n阶连通图G，一个路由选择R是指G中的n（n-1）条路集，其中每个有序点对都有路集中的一条路连接。

The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.

针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。

The Upper Bound for the Diameter of a Regular Connected Graph

正则连通图直径的上界

An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains

无向连通图中求约束条件下近似最长路算法

In this paper, the bond cover of a connected graph was studied.

对连通图的键覆盖进行了研究。

A non complete 6 connected graph is called contraction-critical if it has no any 6-contractible edge.

如果6连通图的一条边收缩后使得所得到的图仍是6连通,则这条边称为6可收缩边.

Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple.

可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。

The inverse degree and R and IC of simple connected graph

简单连通图的反比度和几何反比度

Let G be a simple finite connected graph.

设G是一个有限的简单连通图。

This article analysises the strongly connexity of accessible matrices, it also gives a new approach to identify strongly connected graph from digraph.

文中用可达矩阵分析了有向图的强连通性，并给出了一种判别有向图为强连通图的新方法。

Clustering Algorithm Based on Dynamic Division of Connected Graph

基于连通图动态分裂的聚类算法